Complete Exchange on a Wormhole Routed Mesh
نویسندگان
چکیده
The complete exchange (or all-to-all personalized) communication pattern occurs frequently in many important parallel computing applications. We discuss several algorithms to perform complete exchange on a two dimensional mesh connected computer with worm-hole routing. We propose algorithms for both power-of-two and non power-of-two meshes as well as an algorithm which works for any arbitrary mesh. We have developed analytical models to estimate the performance of the algorithms on the basis of system parameters. These models take into account the eeects of link contention and other characteristics of the communication system. Performance results on the Intel Touchstone Delta are presented and analyzed.
منابع مشابه
Wormhole - Routed 3 D MeshNetworks Using Extended Dominating Sets
A new approach to broadcast in wormhole-routed three-dimensional (3D) mesh networks is proposed. The approach extends the concept of dominating sets from graph theory by accounting for the relative distance-insensitivity of the wormhole routing switching strategy and by taking advantage of an all-port communication architecture, which allows each node to simultaneously transmit messages on diie...
متن کاملBandwidth-Optimal Complete Exchange on Wormhole-Routed 2D/Torus Networks: A Diagonal-Propagation Approach
All-to-all personalized communication, or complete exchange, is at the heart of numerous applications in parallel computing. Several complete exchange algorithms have been proposed in the literature for wormhole meshes. However, these algorithms, when applied to tori, can not take advantage of wrap-around interconnections to implement complete exchange with reduced latency. In this paper, a new...
متن کاملBandwidth-Optimal Complete Exchange on Wormhole-Routed 2D/3D Torus Networks: A Diagonal-Propagation Approach
All-to-all personalized communication, or complete exchange, is at the heart of numerous applications in parallel computing. Several complete exchange algorithms have been proposed in the literature for wormhole meshes. However, these algorithms, when applied to tori, can not take advantage of wrap-around interconnections to implement complete exchange with reduced latency. In this paper, a new...
متن کاملComplete Exchange Algorithms in Wormhole-Routed Torus Networks: A Divide-and-Conquer Strategy
We present efficient all-to-all personalized communication algorithms for a 2D torus in wormhole-routed networks. Our complete exchange algorithm adopts divide-and-conquer approach to reduce the start-up latency significantly, which is a good metric for network performance in wormhole networks. The first algorithm recursively divides the whole network into 2 2 networks. After specially designat...
متن کاملEfficient Total-Exchange in Wormhole-Routed Toroidal Cubes
The total-exchange is one of the most dense communication patterns and is at the heart of numerous applications and programming models in parallel computing. In this paper we present a simple randomized algorithm to efficiently schedule the total-exchange on a toroidal mesh with wormhole switching. This algorithm is based on an important property of the wormhole networks that reach high perform...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994